package com.example.demo.leetcode.top;

/**
 * @author xujimou
 * @date 2021/1/18 16:02
 **/
public class Linked_链表合并 {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

        ListNode node1 = null;

        if(l1 == null){
            return l2;
        }
        if(l2 == null){
            return l1;
        }
        // l1节点指向 剩余的部分
        if(l1.val < l2.val){
            l1.next = mergeTwoLists(l1.next,l2);
            return l1;
        }else{
            l2.next = mergeTwoLists(l1,l2.next);
            return l2;
        }


    }




    public class ListNode {
        int val;
        ListNode next;
        ListNode() {}
        ListNode(int val) { this.val = val; }
        ListNode(int val, ListNode next) { this.val = val; this.next = next; }
    }


}
